High-Speed VLSI Architectures for Modular Polynomial Multiplication via Fast Filtering and Applications to Lattice-Based Cryptography

نویسندگان

چکیده

This paper presents a low-latency hardware accelerator for modular polynomial multiplication lattice-based post-quantum cryptography and homomorphic encryption applications. The proposed novel multiplier exploits the fast finite impulse response (FIR) filter architecture to reduce computational complexity of schoolbook multiplication. We also extend this structure $M$-parallel architectures while achieving low-latency, high-speed, full utilization. comprehensively evaluate performance under various settings as well in Saber scheme case study. experimental results show that our reduces computation time area-time product, respectively, compared state-of-the-art designs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Fast Modular Multiplication Method and Its Application to Modular Exponentiation-Based Cryptography

In order to apply exponentiation-based cryptography, such as RSA cryptography and El Gamal cryptography, to a wide range of practical problems, it is desired to devise faster ciphering and deciphering processes. This paper proposes a new algorithm for improving the speed of the exponentiation-based computation. The proposed method is based on the idea in the exponentiation computation that the ...

متن کامل

Applications of Fast Truncated Multiplication in Cryptography

Truncated multiplications compute truncated products, contiguous subsequences of the digits of integer products. For an n-digit multiplication algorithm of time complexity O(nα), with 1 < α ≤ 2, there is a truncated multiplication algorithm, which is constant times faster when computing a short enough truncated product. Applying these fast truncated multiplications, several cryptographic long i...

متن کامل

Fast Montgomery Modular Multiplication and RSA Cryptographic Processor Architectures

New, generic silicon architectures for implementing Montgomery’s multiplication algorithm are presented. These use Carry Save Adders (CSAs) to perform the large word length additions required by this algorithm when used for RSA encryption and decryption. It is shown that using a four-to-two CSA with two extra registers rather than a five-to-two CSA leads to a useful reduction in the critical pa...

متن کامل

A VLSI Algorithm for Modular Multiplication/Division

We propose an algorithm for modular multiplication/division suitable for VLSI implementation. The algorithm is based on Montgomery’s method for modular multiplication and on the extended Binary GCD algorithm for modular division. It can perform either of these operations with a reduced amount of hardware. Both calculations are carried out through iterations of simple operations such as shifts a...

متن کامل

An RNS Based Montgomery Modular Multiplication Algorithm For Cryptography

Montgomery modular multiplication is one of the fundamental operations used in cryptographic algorithms, such as RSA and Elliptic Curve Cryptosystem. The previous Montgomery multipliers perform a single Montgomery multiplication in approximately 2n clock cycles and it requires more number of addition stages for large word length addition, where n is the size of operands in bits. In this paper, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Computers

سال: 2023

ISSN: ['1557-9956', '2326-3814', '0018-9340']

DOI: https://doi.org/10.1109/tc.2023.3251847